Merge sort - PDFSEARCH.IO - Document Search Engine

Merge sort
Results: 170

#	Item
71	CS109A Notes for LectureAnalysis of Mergesort Input size n = length of list to be sorted; Tms(n) = running time of mergesort. 1. Call split on list of length n; takes O(n) time Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:00 Analysis of algorithms Arithmetic Mathematical notation Summation Recurrence relation Time complexity Computational complexity theory NP Merge sort Theoretical computer science Mathematics Applied mathematics
72	Parallelism in Sequential Guy Blelloch Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-04-26 13:42:59 Sorting algorithms Analysis of algorithms Complexity classes Models of computation Circuit complexity Quicksort NC Time complexity Merge sort Theoretical computer science Computational complexity theory Mathematics
73	Microsoft PowerPoint - F.owens.algorithms.ppt Add to Reading List Source URL: gpgpu.org Language: English - Date: 2009-04-05 17:42:52 Mathematics Ken Batcher Graphics hardware Video cards GPGPU Merge sort Sorting network Sort Bitonic sorter Sorting algorithms Computing Order theory
74	Microsoft PowerPoint - H.purcell_algorithms.ppt Add to Reading List Source URL: gpgpu.org Language: English - Date: 2009-04-05 18:15:46 Computing Ken Batcher Sorting network Merge sort Sorting Sort Shader Bitonic sorter Sorting algorithms Order theory Mathematics
75	Microsoft PowerPoint - 05.govindaraju.SortingAndSearching.ppt Add to Reading List Source URL: gpgpu.org Language: English - Date: 2009-04-05 17:45:17 Combinatorics Sorting network Ken Batcher Merge sort Bitonic sorter Sort Sorting algorithms Order theory Mathematics
76	Lecture 7, TuesdaySorting using heaps l We can first build heap, then repeat: remove max. Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2001-04-24 22:06:10 Combinatorics Radix sort Merge sort Heap Quicksort Counting sort Factorial Smoothsort Heapsort Sorting algorithms Mathematics Order theory
77	Sorting by generating the sorting permutation, and the effect of caching on sorting. Arne Maus, [removed] Department of Informatics University of Oslo Add to Reading List Source URL: www.nik.no Language: English - Date: 2004-03-09 04:38:14 Combinatorics Radix sort Quicksort Merge sort Bucket sort Heapsort Sort Flashsort Spreadsort Sorting algorithms Order theory Mathematics
78	High-Performance Sort Chip Shinsuke Azuma, Takao Sakuma, Takashi Nakano, Takaaki Ando, Kenji Shirai [removed] Mitsubishi Electric Corporation Add to Reading List Source URL: www.hotchips.org Language: English - Date: 2013-07-27 22:49:31 Order theory Sorting algorithms Dynamic random-access memory Merge sort Conventional PCI Synchronous dynamic random-access memory Computer hardware Computing Computer memory
79	Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited Cagri Balkesen, Gustavo Alonso Jens Teubner ¨ Add to Reading List Source URL: www.vldb.org Language: English - Date: 2013-09-10 10:14:56 Computer programming Merge sort Radix sort Merge algorithm Hash join Sort-merge join Hash function Bitonic sorter Multi-core processor Sorting algorithms Order theory Mathematics
80	Memory Footprint Matters: Efficient Equi-Join Algorithms for Main Memory Data Processing Spyros Blanas and Jignesh M. Patel University of Wisconsin–Madison {sblanas,jignesh}@cs.wisc.edu Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2014-02-20 11:47:23 Information retrieval Information science Computing Hash join Query optimizer Sort-merge join Hash function Hash table Cryptographic hash function Search algorithms Hashing Sorting algorithms

UPDATE